Extremal optimization for graph partitioning
نویسندگان
چکیده
منابع مشابه
Extremal Optimization for Graph Partitioning
Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the computationally hard (NP-hard) graph partitioning problem. We discuss the scaling behavior of extremal optimization, focusing on the convergence of the average run as a function of run time and system size. The method has a single free para...
متن کاملExtremal optimization of graph partitioning at the percolation threshold
The benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called extremal optimization (EO), is compared with simulated annealing (SA) in extensive numerical simulations. While generally a complex (NP-hard) problem, the optimization of the graph partitions is particularly difficult...
متن کاملPath Optimization for Graph Partitioning Problems
This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very well-known algorithms for partitioning: the Kernighan-Lin algorithm and simulated annealing. Our experiments are described in detail, and the results are presented in such a way as to reveal performance trends b...
متن کاملDistributed Modified Extremal Optimization for Reducing Crossovers in Reconciliation Graph
To determine the mechanism of molecular evolution, a reconciliation graph is constructed from two heterogeneous trees, which are referred to as ordered trees. In the reconciliation graph, the leaf nodes of the two ordered trees face each other. Furthermore, leaf nodes with the same label name are connected to each other by an edge. To carry out reconciliation work efficiently, it is necessary t...
متن کاملDevelopment of Particle Swarm Optimization Based Algorithm for Graph Partitioning
From the review, it is studied that the min cut k – partitioning problem is a fundamental partitioning problem and is NP hard also. Most of the existing partitioning algorithms are heuristic in nature and they try to find a reasonably good solution. These algorithms falls in move – based category in which solution is generated iteratively from an initial solution applying move to the recent sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2001
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.64.026114